Minimization of BDDs using linear transformations based on evolutionary techniques
نویسندگان
چکیده
Binary Decision Diagrams (BDDs) are frequently used in many applications in VLSI CAD. However, they are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on Linear Transformations (LTs), i.e. a special type of spectral techniques, has been proposed. We present an Evolutionary Algorithm (EA) to find an LT for which the BDD becomes small. The genetic operators make use of problem specific knowledge. Experimental results are given to show the efficiency of our approach.
منابع مشابه
International Symposium on Circuits and Systems Orlando, May-June 1999 MINIMIZATION OF BDDS USING LINEAR TRANSFORMATIONS BASED ON EVOLUTIONARY TECHNIQUES
Binary Decision Diagrams (BDDs) are frequently used in many applications in VLSI CAD. However, they are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on Linear Transformations (LTs), i.e. a special type of spectral techniques, has been proposed. We present an Evolutionary Algorithm (EA) to find an LT for whic...
متن کاملBdd Minimization by Linear Transformations
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infeasible. Recently, a new approach for BDD minimization based on linear transformations, i.e. a special type of spectral techniques, has been proposed. In this ...
متن کاملInternational Workshop on Boolean Problems Freiberg , 1998 BDD Minimization by Linear
Binary Decision Diagrams (BDDs) are a powerful tool and are frequently used in many applications in VLSI CAD, like synthesis and veriication. Unfortunately, BDDs are very sensitive to the variable ordering and their size often becomes infea-sible. Recently, a new approach for BDD minimization based on linear transformations , i.e. a special type of spectral techniques, has been proposed. In thi...
متن کاملLinear Transformations and Exact Minimization of BDDs
We present an exact algorithm to nd an optimal linear transformation for the variables of a Boolean function to minimize its corresponding ordered Binary Decision Diagram (BDD). To prune the huge search space, techniques known from algorithms for nding the optimal variable ordering are used. This BDD minimization nds direct application in FPGA design. We give experimental results for a large va...
متن کاملBDD Minimization by Truth Table Permutations
Bern, Meinel and Slobodová [1] have recently proposed a novel technique called cube transformations to minimize the size of binary decision diagrams. Given a Boolean function, they try to find a domain transformation such that the function after the transformation has a smaller BDD. It has been shown that well-chosen transformations enable us to represent compactly the hidden-weight-bit functio...
متن کامل